Call-by-name, call-by-value and the λ-calculus
نویسندگان
چکیده
منابع مشابه
Call-by-Name, Call-by-Value and the lambda-Calculus
This paper examines the old question of the relationship between ISWIM and the &calculus, using the distinction between call-by-value and call-by-name. It is held that the relationship should be mediated by a standardisation theorem. :3ince this leads to difficulties, a new &calcu%~s is introduced whose standardisation theorem gives a good correspondence with ISWIM a-; given by the SECT machine...
متن کاملCall-by-Value λ-calculus and LJQ
LJQ is a focused sequent calculus for intuitionistic logic, with a simple restriction on the first premiss of the usual left introduction rule for implication. In a previous paper we discussed its history (going back to about 1950, or beyond) and presented its basic theory and some applications; here we discuss in detail its relation to call-by-value reduction in lambda calculus, establishing a...
متن کاملCall-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus
To appear in Theoretical Computer Science, special issue on papers presented at MFPS’95. J. Maraist a, M. Odersky a, D.N. Turner b and P. Wadler c a School of Computer and Information Science, University of South Australia, Warrendi Road, The Levels, South Australia 5095, Australia. Email, fmaraist,[email protected]. b An Teallach Limited, Technology Transfer Centre, Kings Buildings, Ma...
متن کاملProof nets and the call-by-value λ-calculus
This paper gives a detailed account of the relationship between (a variant of) the call-by-value lambda calculus and linear logic proof nets. The presentation is carefully tuned in order to realize an isomorphism between the two systems: every single rewriting step on the calculus maps to a single step on proof nets, and viceversa. In this way, we obtain an algebraic reformulation of proof nets...
متن کاملCall-by-value, call-by-name and the vectorial behaviour of the algebraic \lambda-calculus
We examine the relationship between the algebraic λ-calculus, a fragment of the differential λ-calculus and the linear-algebraic λ-calculus, a candidate λ-calculus for quantum computation. Both calculi are algebraic: each one is equipped with an additive and a scalarmultiplicative structure, and their set of terms is closed under linear combinations. However, the two languages were built using ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1975
ISSN: 0304-3975
DOI: 10.1016/0304-3975(75)90017-1